搜索资源列表
Graph
- 图形学完整课件，包括光栅图形学，图形裁剪，基本几何，二维几何，图形变换，三维几何，几何造型，光照模型，曲线与曲面，曲线拟合与双圆弧逼近，交互技术等。-Graphics complete courseware, including raster graphics, graphic cut, basic geometry, two-dimensional geometry, graph transformation, three-dimensional geometry, geometric mod
maxflow-v3.01.src.tar
- 基于文献“计算机视觉中的能量函数最小化的最小割/最大流”的最大流算法实现-An implementation of the maxflow algorithm described in An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Computer Vision. Yuri Boykov and Vladimir Kolmogorov.
10
- This source code contains: -BFS algorithm on a graph -Edmonds Karp algorithm on a graph -minimal cut on a graph -disjunct paths in a graph.
grah_cut_[11]
- classical paper of graph cut methods in video processing used for image partitioning-classical paper of graph cut methods in video processing used for image partitioning
KZ-ECCV02-graphcuts
- minimizing energy function,such as in MRF,by graph cut methods
KZ-PAMi04
- also classical papers in energy minimizing by graph cut methods
graph--cut
- 图形裁剪： 线段裁剪和多边形裁剪的简单示例-Graphics Clipping: Line Clipping and Polygon Clipping simple example
Graph
- 功能比较全面，可以实现三维图形变换及二维图形裁剪的功能-three dimensional transform two dimensional cut out
GCimagematching
- 利用图割方法进行立体匹配的文档，有硕士论文有小论文，我从十几篇当中挑出来的，感觉很有用，方便没有数据库用的同学-Three-dimensional graph cut method using matching documents, with a small paper Master thesis, I picked out from more than a dozen of them, feel useful, to facilitate students with no database
Novel-robust-and-self-adaptive-road-following-algo
- 本文提出一种基于改进图模型的自适应道路跟踪算法,利用基于边缘置信度的均值偏移 算法,将图像划分为具有准确边界的若干同质区域,以这些区域为结点构建改进图模型,然后根据道路/非路模型统计信息,采用 Graph Cut 方法获得最终的二值图。该算法将Graph Cut 和均值偏移方法有效融合,以克服各自缺点,并通过道路/非路模型自更 新使得该算法可有效适应室外环境下复杂场景变化。-Two dimension road following is a crucial task of visio
5
- 图形相交—相切。用vc++6.0实现的把相交图形相交的部分剪切。-Graphics intersection- tangent. Achieved with the vc++6.0 intersection part of the intersection graph cut.
graphcut
- 最大流最小割，用于图片分割以及与图片分割类似的网络问题-Maxflow/minium cut,used in graph cut or other similar problem
MaxCut
- This program implement the Max cut Max_Cut algorithm , as a deterministic algorithm using a pair wise method , which force the algorithm for deterministic solution with solution better then |E|/2 the graph is implemented using an adjacent matrix,
regionpushrelabel-v1.01
- graphcut应用 Global optimisation via s-t graph cuts is widely used in computer vision and graphics. To obtain high-resolution output, graph cut methods must construct massive N-D grid-graphs containing billions of vertices. We show that when th
boykov-iccv-01
- 有关于图像分割的一篇重要文献，写得比较清晰，理解容易-graph cut
MatlabTUGE
- 基于matlab的一个算法主要是进行图割可以把一张图像按某些特征分割-Based on a matlab algorithm is mainly carried out by graph cut to an image according to the certain feature segmentation
Graph_seg
- 采用Graph Cut算法进行multiple-label的图像分割，算法很完整，非常适合初学者以及开发人员参考-multiple-label image segmentation using Graph Cut based algorithm, suitable for beginners and developers
GCv2p3
- Graph Cut 代码,是从国外网站找下来的，有一定参考价值！-Graph Cut Code
graphCut
- 该文件是C++代码，用于计算图割（GraphCut）的代码。-This code is the implementation of Graph Cut.
HOCR1.02
- 随机场中高阶热能函数计算软件，可以应用于图像复原模型中。-Higher-Order Clique Reduction software。Higher-Order Clique Reduction in Binary Graph Cut